Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
41	Distribution of forcing and anti-forcing numbers of random perfect matchings on hexagonal chains and crowns Hsien-Kuei Hwanga , Hongchuan Leib, Yeong-Nan Yehc , Heping Zhangd a Institute Add to Reading List Source URL: 140.109.74.92 Language: English - Date: 2015-01-21 18:54:09 NP-complete problems Combinatorial optimization Matching Graph coloring Forcing Hexagon Recurrence relation Dominating set Mathematics Theoretical computer science Graph theory
42	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
43	CCCG 2010, Winnipeg MB, August 9–11, 2010 3D Local Algorithm for Dominating Sets of Unit Disk Graphs A.E. Abdallah and T. Fevens and J. Opatrny∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:14 Deltahedra Octahedron Connected dominating set Dominating set Dominator Routing Truncated octahedron Tree Geometry Convex geometry Theoretical computer science
44	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
45	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
46	Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-03-19 09:17:44 NP-complete problems Interval graph Vertex cover Graph coloring Matching Independent set Dominating set Path decomposition Graph theory Theoretical computer science Mathematics
47	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
48	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
49	LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:26:19 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Dominating set Time complexity Algorithm Mathematical optimization NP Theoretical computer science Computational complexity theory Applied mathematics
50	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics